THE ABURAS HEURISTIC: A MODIFIED HEURISTIC FOR SCHEDULING UNRELATED PARALLEL MACHINE PROBLEMS
نویسندگان
چکیده
منابع مشابه
A Local Search Heuristic for Unrelated Parallel Machine Scheduling with Efficient Neighborhood Search
The parallel mechine scheduling problem with unrelated machines is studied where the objective is to minimize the maximum makespan. In this paper, new local search algorithms are proposed where the neighborhood search of a solution uses the “efficiency” of the machinea for each job. It is shown that this method yields better solutions and shorter running times than the more general local search...
متن کاملA Heuristic Serial Schedule Algorithm for Unrelated Parallel Machine Scheduling With Precedence Constraints
The paper presents a priority rule-based heuristic serial schedule (SS) algorithm for a deterministic scheduling problem where multiple jobs with arbitrary precedence constraints are processed on multiple unrelated parallel machines. The objective is to minimise makespan. The priority rule employs the arithmetic mean and deviation of the processing times to determine the prior job-machine pair....
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملHeuristic algorithms for a complex parallel machine scheduling problem
In this work we present a new scheduling model for parallel machines, which extends the multiprocessor scheduling problem with release times for minimizing the total tardiness, and also extends the problem of vehicle routing with time windows. This new model is motivated by a resource allocation problem which appears in the service sector. We present two class of heuristic algorithms for the so...
متن کاملEfficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines
This paper discusses an efficient heuristic to minimize the makespan of scheduling n independent jobs on m unrelated parallel machines. The problem of scheduling the jobs on the unrelated parallel machines is combinatorial in nature. Hence, the heuristic approach is inevitable for quicker solution. In this paper, a simple and efficient heuristic is designed to minimize the makespan of schedulin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The South African Journal of Industrial Engineering
سال: 2012
ISSN: 2224-7890,1012-277X
DOI: 10.7166/18-1-137